A Generalized Variable Projection Algorithm for Least Squares Problems in Atmospheric Remote Sensing

نویسندگان

چکیده

This paper presents a solution for efficiently and accurately solving separable least squares problems with multiple datasets. These involve determining linear parameters that are specific to each dataset while ensuring the nonlinear remain consistent across all A well-established approach such is variable projection algorithm introduced by Golub LeVeque, which effectively reduces problem its component. However, this assumes datasets have equal sizes identical auxiliary model parameters. article motivated real-world remote sensing application where these assumptions do not apply. Consequently, we propose generalized extends original theory overcome limitations. The new has been implemented tested using both synthetic real satellite data atmospheric carbon dioxide retrievals. It also compared conventional state-of-the-art solvers, advantages thoroughly discussed. experimental results demonstrate proposed significantly outperforms other methods in terms of computation time, maintaining comparable accuracy stability. Hence, novel method can positive impact on future applications could be valuable scientific fitting similar properties.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable projection for nonlinear least squares problems

The variable projection algorithm of Golub and Pereyra (1973) has proven to be quite valuable in the solution of nonlinear least squares problems in which a substantial number of the parameters are linear. Its advantages are efficiency and, more importantly, a better likelihood of finding a global minimizer rather than a local one. The purpose of our work is to provide a more robust implementat...

متن کامل

Numerical methods for generalized least squares problems

Usually generalized least squares problems are solved by transforming them into regular least squares problems which can then be solved by well-known numerical methods. However, this approach is not very effective in some cases and, besides, is very expensive for large scale problems. In 1979, Paige suggested another approach which consists of solving an equivalent equality-constrained least sq...

متن کامل

Efficient Algorithm for a Class of Least Squares Estimation Problems

We consider a problem to schedule a set of jobs on a singlemachine under the constraint that the maximum job completion timedoes not exceed a given limit. Before a job is released for processing, itmust undergo some preprocessing treatment which consumes resources.Itis assumed that the release time of a job is a positive strictly decreasingcontinuous function of the amou...

متن کامل

A Fast Algorithm for Solving Regularized Total Least Squares Problems

The total least squares (TLS) method is a successful approach for linear problems if both the system matrix and the right hand side are contaminated by some noise. For ill-posed TLS problems Renaut and Guo [SIAM J. Matrix Anal. Appl., 26 (2005), pp. 457 476] suggested an iterative method which is based on a sequence of linear eigenvalue problems. Here we analyze this method carefully, and we ac...

متن کامل

A Least Squares Q-Learning Algorithm for Optimal Stopping Problems

We consider the solution of discounted optimal stopping problems using linear function approximation methods. A Q-learning algorithm for such problems, proposed by Tsitsiklis and Van Roy, is based on the method of temporal differences and stochastic approximation. We propose alternative algorithms, which are based on projected value iteration ideas and least squares. We prove the convergence of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11132839